An update on the sum-product problem

نویسندگان

چکیده

Abstract We improve the best known sum-product estimates over reals. prove that \[\max(|A+A|,|A+A|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,,\] for a finite $A\subset \mathbb {R}$ , following streamlining of arguments Solymosi, Konyagin and Shkredov. include several new observations to our techniques. Furthermore, \[|AA+AA|\geq |A|^{\frac{127}{80} o(1)}\,.\] Besides, convex set A we show \[|A+A|\geq |A|^{\frac{30}{19}-o(1)}\,.\] This paper is largely self-contained.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Sum-Product Problem on Elliptic Curves

Let E be an ordinary elliptic curve over a finite field IF q of q elements and x(Q) denote the x-coordinate of a point Q = (x(Q), y(Q)) on E. Given an IF q-rational point P of order T , we show that for any subsets A, B of the unit group of the residue ring modulo T , at least one of the sets {x(aP) + x(bP) : a ∈ A, b ∈ B} and {x(abP) : a ∈ A, b ∈ B} is large. This question is motivated by a se...

متن کامل

An Algorithm to Solve the Equal-Sum-Product Problem

A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their product. An examination of the use of Binary Search Trees in implementing the algorithm into a working program is given. In addition an application of the algorith...

متن کامل

On the elliptic curve analogue of the sum-product problem

Let E be an elliptic curve over a finite field Fq of q elements and x(P ) to denote the x-coordinate of a point P = (x(P ), y(P )) ∈ E. Let ⊕ denote the group operation in the Abelian group E(Fq) of Fq -rational points on E. We show that for any sets R,S ⊆ E(Fq) at least one of the sets { x(R)+ x(S): R ∈R, S ∈ S} and {x(R⊕ S): R ∈R, S ∈ S} is large. This question is motivated by a series of rec...

متن کامل

The Erdős - Szemerédi problem on sum set and product set

The basic theme of this paper is the fact that if A is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erdős-Szemerédi [E-S]. (see also [El], [T], and [K-T] for related aspects.) Only much weaker results or very special cases of this conjecture are presently known. One approach consists of assuming the...

متن کامل

Erdős-szemerédi Problem on Sum Set and Product Set

The basic theme of this paper is the fact that if A is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erdős-Szemerédi [E-S]. (see also [El], [T], and [K-T] for related aspects.) Only much weaker results or very special cases of this conjecture are presently known. One approach consists of assuming the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical proceedings of the Cambridge Philosophical Society

سال: 2021

ISSN: ['0305-0041', '1469-8064']

DOI: https://doi.org/10.1017/s0305004121000633